Members
Overall Objectives
Research Program
Application Domains
Highlights of the Year
New Software and Platforms
New Results
Partnerships and Cooperations
Dissemination
Bibliography
XML PDF e-pub
PDF e-Pub


Section: New Software and Platforms

Newton-MRF

Functional Description MAP inference in MRFs can be performed through the LP relaxation approach. This project was a study of the feasibility and benefit of Newton-type methods for solving the optimization problem that is obtained by smoothing the dual of the LP relaxation. The project TRN-MRF is a trust-region Newton method that can address inference in higher order MRFs, for cases in which decomposition according to individual cliques leads to practical convergence. The project QN-MRF works for problems that need decomposition according to larger sub-problems (like chains of higher order cliques) and it works as long as a node is shared by exactly two sub-problems.